//
// Created by xili on 2024/8/25 10:55.
// GO BIG OR GO HOME.
//
#include "leetcode.h"

class Solution {
public:
    vector<int> getFinalState(vector<int> &nums, int k, int multiplier) {
        for (int i = 0; i < k; i++) {
            *min_element(nums.begin(), nums.end()) *= multiplier;
        }
        return nums;
    }
};